Optimization of saving production cost in plastic jute sacks with dynamic programming
نویسندگان
چکیده
منابع مشابه
Joint pricing and production management: a geometric programming approach with consideration of cubic production cost function
Coordination and harmony between different departments of a company can be an important factor in achieving competitive advantage if the company corrects alignment between strategies of different departments. This paper presents an integrated decision model based on recent advances of geometric programming technique. The demand of a product considers as a power function of factors such as produ...
متن کاملDamaging biting behaviors in intensively kept rearing gilts: the effect of jute sacks and relations with production characteristics.
Pigs may display biting behavior directed at pen mates, resulting in body damage such as tail wounds. We assessed the suitability of jute sacks (hung vertically at wall) to reduce biting behaviors and tail wounds in rearing gilts. Additionally, we assessed several characteristics of different types of tail biters. Tail docked rearing gilts originated from 72 litters, which were kept in partly s...
متن کاملqfd planning with cost consideration in fuzzy environment
در عصر حاضر که رقابت بین سازمان ها بسیار گسترش یافته است، مطالعه و طرحریزی سیستم های تولیدی و خدماتی به منظور بهینه سازی عملکرد آنها اجتناب ناپذیر می باشد. بخش عمده ای از رقابت پذیری سازمان ها نتیجه رضایتمندی مشتریان آنها است. میزان موفقیت سازمان های امروزی به تلاش آنها در جهت شناسایی خواسته ها و نیازهای مشتریان و ارضای این نیازها بستگی دارد. از طرفی کوتاه کردن زمان ارائه محصول/خدمات به مشتریان...
15 صفحه اولSPE 141677 Use of Approximate Dynamic Programming for Production Optimization
In production optimization, we seek to determine the well settings (bottomhole pressures, flow rates) that maximize an objective function such as net present value. In this paper we introduce and apply a new approximate dynamic programming (ADP) algorithm for this optimization problem. ADP aims to approximate the global optimum using limited computational resources via a systematic set of proce...
متن کاملTree Decompositions of Graphs: Saving Memory in Dynamic Programming
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced “anchor technique” is closely related to a tree-like set covering problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2018
ISSN: 2261-236X
DOI: 10.1051/matecconf/201819714008